翻訳と辞書 Words near each other ・ Knowledge Plaza ・ Knowledge policy ・ Knowledge Politics ・ Knowledge Power ・ Knowledge process outsourcing ・ Knowledge Query and Manipulation Language ・ Knowledge relativity ・ Knowledge relevance ・ Knowledge representation and reasoning ・ Knowledge retrieval ・ Knowledge Revolution ・ Knowledge River ・ Knowledge Search ・ Knowledge sharing ・ Knowledge society ・ Knowledge space ・ Knowledge space (philosophy) ・ Knowledge spillover ・ Knowledge survey ・ Knowledge Systems Laboratory ・ Knowledge Through Science ・ Knowledge transfer ・ Knowledge Transfer Partnerships ・ Knowledge Transferring Assessment ・ Knowledge translation ・ Knowledge triangle ・ Knowledge TV ・ Knowledge Universe ・ Knowledge Unlatched ・ Knowledge Utilization Research Center Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Knowledge space ： ウィキペディア英語版 Knowledge space In mathematical psychology, a knowledge space is a combinatorial structure describing the possible states of knowledge of a human learner.〔.〕 To form a knowledge space, one models a domain of knowledge as a set of concepts, and a feasible state of knowledge as a subset of that set containing the concepts known or knowable by some individual. Typically, not all subsets are feasible, due to prerequisite relations among the concepts. The knowledge space is the family of all the feasible subsets. Knowledge spaces were introduced in 1985 by Jean-Paul Doignon and Jean-Claude Falmagne〔.〕 and have since been studied by many other researchers.〔A (bibliography on knowledge spaces ) maintained by Cord Hockemeyer contains over 300 publications on the subject.〕 They also form the basis for two computerized tutoring systems, (RATH ) and ALEKS.〔(Introduction to Knowledge Spaces: Theory and Applications ), Christof Körner, Gudrun Wesiak, and Cord Hockemeyer, 1999 and 2001.〕 It is possible to interpret a knowledge space as a special form of a restricted latent class model.〔.〕 ==Definitions== Some basic definitions used in the knowledge space approach - *A tuple $(Q,\; K)$ consisting of a non-empty set $Q$ and a set $K$ of subsets from $Q$ is called a ''knowledge structure'' if $K$ contains the empty set and $Q$. *A knowledge structure is called a ''knowledge space'' if it is closed under union, i.e. if $S,\; T\; \backslash in\; Q$ implies $S\backslash cup\; T\; \backslash in\; Q$. *A knowledge space is called a ''quasi-ordinal knowledge space'' if it is in addition closed under intersection, i.e. if $S,\; T\; \backslash in\; Q$ implies $S\backslash cap\; T\; \backslash in\; Q$. Closure under both unions and intersections gives (''Q'',∪,∩) the structure of a distributive lattice; Birkhoff's representation theorem for distributive lattices shows that there is a one-to-one correspondence between the set of all quasiorders on Q and the set of all quasi-ordinal knowledge spaces on Q. I.e., each quasi-ordinal knowledge space can be represented by a quasi-order and vice versa. An important subclass of knowledge spaces, the ''well-graded knowledge spaces'' or ''learning spaces'', can be defined as satisfying two additional mathematical axioms: # If $S$ and $T$ are both feasible subsets of concepts, then $S\backslash cup\; T$ is also feasible. In educational terms: if it is possible for someone to know all the concepts in ''S'', and someone else to know all the concepts in ''T'', then we can posit the potential existence of a third person who combines the knowledge of both people. # If $S$ is a nonempty feasible subset of concepts, then there is some concept ''x'' in ''S'' such that $S\backslash setminus\backslash$ is also feasible. In educational terms: any feasible state of knowledge can be reached by learning one concept at a time, for a finite set of concepts to be learned. A set family satisfying these two axioms forms a mathematical structure known as an antimatroid. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Knowledge space」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.